DP-Complete Problems Derived from Extremal NP-Complete Properties
نویسندگان
چکیده
In contrast to the extremal variants of coNP-complete problems, which are frequently DP-complete, many extremal variants of NP-complete problems are in P. We investigate the extremal variants of two NP-complete problems, the extremal colorability problem with restricted degree and the extremal unfrozen non-implicant problem, and show that both of them are DP-complete. As far as we know, no extremal variant of an NP-complete problem has been shown to be DP-complete before.
منابع مشابه
Exact Complexity of Exact-Four-Colorability
Let Mk ⊆ N be a given set that consists of k noncontiguous integers. Define Exact-Mk-Colorability to be the problem of determining whether χ(G), the chromatic number of a given graph G, equals one of the k elements of the set Mk exactly. In 1987, Wagner [Wag87] proved that Exact-Mk-Colorability is BH2k(NP)-complete, where Mk = {6k + 1, 6k + 3, . . . , 8k − 1} and BH2k(NP) is the 2kth level of t...
متن کاملThe Complexity of Counting in Sparse, Regular, and Planar Graphs
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of graphs. In particular, it is shown that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to planar bipartite graphs of bounded degree or regular graphs of constant degree. To achieve these ...
متن کاملThe Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...
متن کاملThe complexity of deciding whether a graph admits an orientation with fixed weak diameter
An oriented graph −→ G is said weak (resp. strong) if, for every pair {u, v} of vertices of −→ G , there are directed paths joining u and v in either direction (resp. both directions). In case, for every pair of vertices, some of these directed paths have length at most k, we call −→ G k-weak (resp. k-strong). We consider several problems asking whether an undirected graph G admits orientations...
متن کاملA framework for coalitional normative systems
We propose coalitional normative system (cns), which can selectively restrict the joint behavior of a coalition, in this paper. We extend the semantics of atl and propose Coordinated atl (co-atl) to support the formalizing of cns. We soundly and completely characterize the limitation of the normative power of a coalition by identifying two fragments of co-atl language corresponding to two types...
متن کامل